Classifying tree structures using elastic matching of sequence encodings
نویسندگان
چکیده
Structures of tree topology are frequently encountered in nature and in a range of scientific domains. In this paper, a multi-step framework is presented to classify tree topologies introducing the idea of elastic matching of their sequence encodings. Initially, representative sequences of the branching topologies are obtained using node labeling and tree traversal schemes. The similarity between tree topologies is then quantified by applying elastic matching techniques. The resulting sequence alignment reveals corresponding node groups providing a better understanding of matching tree topologies. The new similarity approach is explored using various classification algorithms and is applied to a medical dataset outperforming state-of-the-art techniques by at least 6.6% and 3.5% in terms of absolute specificity and accuracy correspondingly.
منابع مشابه
Minimizing distortion caused by welding, by sequencing optimization in a large steel panel
Increasingly, Welding is used in industry for assembled various products, such as ships, cars, trains and bridges. Welding distortion often results such as lack of accuracy during assembly and will have increases manufacturing costs. So, predict and reduce welding distortion is very important to improve the quality of welded structures. In this study, firstly, a prediction method of welding di...
متن کاملMinimizing distortion caused by welding, by sequencing optimization in a large steel panel
Increasingly, Welding is used in industry for assembled various products, such as ships, cars, trains and bridges. Welding distortion often results such as lack of accuracy during assembly and will have increases manufacturing costs. So, predict and reduce welding distortion is very important to improve the quality of welded structures. In this study, firstly, a prediction method of welding di...
متن کاملDiscovering and Matching Elastic
This paper presents techniques for discovering and matching rules with elastic patterns. Elastic patterns are ordered lists of elements that can be stretched along the time axis. For example, hA; A; B; B; Bi is an instance of an elastic pattern AB while hA; C; Bi is not. Elastic patterns are useful for discovering rules from data sequences with diierent sampling rates. For fast discovery of rul...
متن کاملDiscovering and Matching Elastic Rules from Sequence Databases
This paper presents techniques for discovering and matching rules with elastic patterns. Elastic patterns are ordered lists of elements that can be stretched along the time axis. Elastic patterns are useful for discovering rules from data sequences with different sampling rates. For fast discovery of rules whose heads (left-hand sides) and bodies (right-hand sides) are elastic patterns, we cons...
متن کاملEncodings of Multicast Trees
In this paper, we present efficient ways of encoding multicast trees. Multicast tree encodings provide a convenient way of performing stateless and explicit multicast routing in networks and overlays. We show the correspondence of multicast trees to theoretical tree data structures and give lower bounds on the number of bits needed to represent multicast trees. Our encodings can be used to repr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Neurocomputing
دوره 163 شماره
صفحات -
تاریخ انتشار 2015